- Title
- Generalized interlinked cycle cover for index coding
- Creator
- Thapa, Chandra; Ong, Lawrence; Johnson, Sarah J.
- Relation
- 2015 IEEE Information Theory Workshop (ITW2015). Proceedings of the 2015 IEEE Information Theory Workshop (Jeju, Korea 11-15 October, 2015) p. 4-8
- Relation
- ARC.FT110100195, ARC.FT140100219 & ARC.DP150100903 http://purl.org/au-research/grants/arc/DP150100903
- Publisher Link
- http://dx.doi.org/10.1109/ITWF.2015.7360723
- Publisher
- Institute of Electrical and Electronics Engineers (IEEE)
- Resource Type
- conference paper
- Date
- 2015
- Description
- A source coding problem over a noiseless broadcast channel where the source is preinformed about the contents of the cache of all receivers, is an index coding problem. Furthermore, if each message is requested by one receiver, then we call this an index coding problem with a unicast message setting. This problem can be represented by a directed graph. In this paper, we first define a structure (we call generalized interlinked cycle (GIC)) in directed graphs. A GIC consists of cycles which are interlinked in some manner (i.e., not disjoint), and it turns out that the GIC is a generalization of cliques and cycles. We then propose a simple scalar linear encoding scheme with linear time encoding complexity. This scheme exploits GICs in the digraph. We prove that our scheme is optimal for a class of digraphs with message packets of any length. Moreover, we show that our scheme can outperform existing techniques, e.g., partial clique cover, local chromatic number, composite-coding, and interlinked cycle cover.
- Subject
- broadcast channels; directed graphs; source coding
- Identifier
- http://hdl.handle.net/1959.13/1315816
- Identifier
- uon:23002
- Identifier
- ISBN:9781467378536
- Language
- eng
- Reviewed
- Hits: 895
- Visitors: 1046
- Downloads: 0
| Thumbnail | File | Description | Size | Format |
|---|